Efficient parameterized HSS iteration methods for complex symmetric linear systems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regularized HSS iteration methods for saddle-point linear systems

We propose a class of regularized Hermitian and skew-Hermitian splitting methods for the solution of large, sparse linear systems in saddle-point form. These methods can be used as stationary iterative solvers or as preconditioners for Krylov subspacemethods.We establish unconditional convergence of the stationary iterations and we examine the spectral properties of the corresponding preconditi...

متن کامل

Regularized HSS Iteration Method for Saddle - Point Linear Systems

We propose a class of regularized Hermitian and skew-Hermitian splitting methods for the solution of large, sparse linear systems in saddle-point form. These methods can be used as stationary iterative solvers or as preconditioners for Krylov subspace methods. We establish unconditional convergence of the stationary iterations and we examine the spectral properties of the corresponding precondi...

متن کامل

A Modified Hss Iteration Method for Solving the Complex Linear Matrix Equation

In this paper, a modified Hermitian and skew-Hermitian splitting (MHSS) iteration method for solving the complex linear matrix equation AXB = C has been presented. As the theoretical analysis shows, the MHSS iteration method will converge under certain conditions. Each iteration in this method requires the solution of four linear matrix equations with real symmetric positive definite coefficien...

متن کامل

Iterative Methods for the Solution of Very Large Complex Symmetric Linear Systems

In the eld of computational electrodynamics the discretization of Maxwell's equations using the Finite Integration Theory (FIT) yields very large, sparse, complex symmetric linear systems of equations. For this class of complex non-Hermitian systems a number of conjugate gradient-type algorithms is considered. The complex version of the biconjugate gradient (BiCG) method by Jacobs can be extend...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 2017

ISSN: 0898-1221

DOI: 10.1016/j.camwa.2016.10.022